Semantic Query Optimization for Bottom-Up Evaluation

نویسندگان

  • Parke Godfrey
  • Jarek Gryz
  • Jack Minker
چکیده

Semantic query optimization uses semantic knowledge in databases (represented in the form of integrity constraints) to rewrite queries and logic programs to achieve eecient query evaluation. Much work has been done to develop various techniques for optimization. Most of it, however, is applicable to top-down query evaluation strategies. Moreover, little attention has been paid to the cost of the optimization. We address the issue of semantic query optimization for bottom-up query evaluation strategies with an emphasis on overall eeciency. We focus on a single optimization technique, join elimination. We discuss factors that innuence the cost of semantic optimization, and present two diierent abstract algorithms for optimization. The rst pre-processes a query statically before it is evaluated ; the second combines query evaluation with semantic optimization using heuristics to achieve the largest possible savings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation Alternatives for Bottom-Up Evaluation

Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDmagic that ensures that only facts relevant for the query can be derived. Then bottomup evaluation simply performs the iteration of the standard TP -operator to compute the minimal model. However, there are different ways to imp...

متن کامل

Query expansion based on relevance feedback and latent semantic analysis

Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expa...

متن کامل

Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources

In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevant Semantic Web data sources using structural query features and a term index. This algorithm is based on the observation that the join selectivity of a pair of query triple patterns is often higher than the overall selectivity ...

متن کامل

An Approach on Semantic Query Optimization for Deductive Databases

In this article we present a learning method to obtain rules for the semantic query optimization in deductive databases. Semantic query optimization can dramatically speed up deductive database query answering by knowledge intensive reformulation. We will present a learning method for rules that will help to semantically optimize queries for deductive databases.i We tried to change the algorith...

متن کامل

Bottom-Up Evaluation and Query Optimization of Well-Founded Models

We present a bottom-up operational procedure for computing well-founded models of allowed programs with negation. This procedure provides a practical method of handling programs that involve unstratiied negation in a manner that may be mixed with other evaluation approaches, such as semi-naive evaluation and various program transformations. We deene classes of programs and sideways information ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996